Optimization of operations in container terminals: hierarchical vs integrated approaches

نویسندگان

  • Ilaria Vacca
  • Matteo Salani
  • Michel Bierlaire
چکیده

Over the last years, international sea freight container transportation has grown dramatically and container terminals play nowadays a key role within the global shipping network. Terminal’s operations have received increasing interest in the scientific literature and operations research techniques are more and more used to improve efficiency and productivity. In this work we provide an overview of container terminal’s operations and associated decision problems. We review state-of-the-art optimization approaches in terminal’s management and we discuss what are in our opinion the current research trends. In particular, we focus on the following streams: the integrated optimization of interdependent decision problems, the analysis of issues related to traffic congestion in the yard and the tactical planning of operations. The discussion is based on the Tactical Berth Allocation Problem (TBAP), an integrated decision problem that deals with the simultaneous optimization of berth allocation and quay crane assignment. Yard housekeeping costs are also taken into account in the objective function. We use the TBAP as a case study to illustrate the benefits of an integrated optimization approach. A comparative analysis with the traditional hierarchical solution approach is provided. Computational results based on real-world data provided by the MCT (port of Gioia Tauro, Italy) show that the additional computational effort required by the integrated optimization approach allows for more efficient solutions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling Single-Load and Multi-Load AGVs in Container Terminals

In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...

متن کامل

A Simulation Model for Optimization of the Internal Handling Fleet Size at Shahid Rajaee Container Port Based on Performance Evaluation

The dramatic increasing of sea-freight container transportations and the developing trend for using containers in the multimodal handling systems through the sea, rail, road and land in the present market cause some challenges to the general managers of container terminals such as increasing demand, competitive situation, new investments and expansion of new activities and the need to use new m...

متن کامل

A New Approach for Sequencing Loading and Unloading Operations in the Seaside Area of a Container Terminal

Due to the considerable growth in the worldwide container transportation, optimization of container terminal operations is becoming highly needed to rationalize the use of logistics resources. For this reason, we focus our study on the Quay Crane Scheduling Problem (QCSP), which is a core task of managing maritime container terminals. From this planning problem arise two decisions to be made: T...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

Scheduling in Container Terminals using Network Simplex Algorithm

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010